Comparing Hierarchical Data in External Memory
نویسنده
چکیده
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, respectively, 4mn+7m+5n, 6S, andO(MN+(M+N )S1:5), where M and N are the input tree sizes, S is the block size, m = M=S, and n = N=S. This algorithm can make effective use of surplus RAM capacity to quadratically reduce I/O cost. We extend to trees the commonly used mapping from sequence comparison problems to shortest-path problems in edit graphs.
منابع مشابه
Sorting hierarchical data in external memory for archiving
Sorting hierarchical data in external memory is necessary for a wide variety of applications including archiving scientific data and dealing with large XML datasets. The topic of sorting hierarchical data, however, has received little attention from the research community so far. In this paper we focus on sorting arbitrary hierarchical data that far exceed the size of physical memory. We propos...
متن کاملSorting Hierarchical Data in External Memory
Sorting hierarchical data in external memory is needed in a wide variety of applications including archiving scientific data and dealing with large XML datasets. The topic of sorting hierarchical data has received little attention form the research community so far. In this paper, we focus on sorting arbitrary hierarchical datasets that exceed the size of physical memory. We propose HErMeS, an ...
متن کاملFFTs in External or Hierarchical
Conventional algorithms for computing large one-dimensional fast Fourier transforms (FFTs), even those algorithms recently developed for vector and parallel computers, are largely unsuitable for systems with external or hierarchical memory. The principal reason for this is the fact that most FFT algorithms require at least m complete passes through the data set to compute a 2 m-point FFT. This ...
متن کاملCharacterizing imageability in Gajar houses of Tabriz
Aims: From Lufor’s perspective, space is constructed based on spatial operation, recreation and the space in which recreation takes place. This approach is a descriptive view of the relationship between space from a materialistic point of view and its dominant ideas with its dwellers. In this perspective, humans integrate distinct and indistinct data of space and create map-like mental images f...
متن کاملOut of core construction of patch trees
Current Level of Detail (LoD) approaches for triangle meshes use variably triangulated mesh patches, in order to approximate the original mesh surface. The approximation is synthesized from some of these patches, which must cover the whole surface and must not intersect each other. The patches are chosen according to the necessary view dependent triangulation. This paper addresses the creation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999